A Foundation of Programming a Multi-tape Quantum Turing Machine
نویسنده
چکیده
The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multihead Quantum Turing machines with multi final states that also allow tape heads to stay still.
منابع مشابه
Classically controlled quantum computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modeling this standard situation, we introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing machine with a quantum tape for acting on quantum data, and a classical transition function for a formalized classical control. In CQTM, unitary transformations and qu...
متن کاملLocal transition functions of quantum Turing machines
Foundations of the notion of quantum Turing machines are investigated. According to Deutsch’s formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local transition functions are characterized for fully general quantum Turing machines, including multi-tape quantum Turing machines, extending an earlier attempt due to ...
متن کاملar X iv : c s / 03 10 04 6 v 2 [ cs . C C ] 1 4 Ju n 20 04 Theory of One Tape Linear Time Turing Machines ∗
A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machi...
متن کاملQuantum function computation using sublogarithmic space (abstract & poster)
We examine the power of quantum Turing machines (QTM’s) which compute string-valued functions of their inputs using small workspace. A (probabilistic or quantum) Turing machine has three tapes: A read-only input tape, a read/write work tape, and a “1.5-way" write-only output tape. Consider a partial function f : Σ 1 → Σ 2 , where Σ1 and Σ2 are the input and output tape alphabets, respectively. ...
متن کاملTheory of One Tape Linear Time Turing Machines
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) ...
متن کامل